Ramsey Graphs Induce Subgraphs of Many Different Sizes
نویسندگان
چکیده
A graph on n vertices is said to be C-Ramsey if every clique or independent set of the graph has size at most C log n. The only known constructions of Ramsey graphs are probabilistic in nature, and it is generally believed that such graphs possess many of the same properties as dense random graphs. Here, we demonstrate one such property: for any fixed C > 0, every C-Ramsey graph on n vertices induces subgraphs of at least n2−o(1) distinct sizes. This near-optimal result is closely related to two unresolved conjectures, the first due to Erdős and McKay and the second due to Erdős, Faudree and Sós, both from 1992.
منابع مشابه
Sizes of Induced Subgraphs of Ramsey Graphs
An n-vertex graph G is c-Ramsey if it contains neither a complete nor an empty induced subgraph of size greater than c log n. Erdős, Faudree and Sós conjectured that every c-Ramsey graph with n vertices contains Ω(n5/2) induced subgraphs any two of which differ either in the number of vertices or in the number of edges, i.e. the number of distinct pairs (|V (H)|, |E(H)|), as H ranges over all i...
متن کاملInduced subgraphs with distinct sizes
We show that for every 0 < < 1/2, there is an n0 = n0( ) such that if n > n0 then every n-vertex graph G of size at least ( n 2 ) and at most (1 − ) ( n 2 ) contains induced k-vertex subgraphs with at least 10−7k different sizes, for every k ≤ n 3 . This is best possible, up to a constant factor. This is also a step towards a conjecture by Erdős, Faudree and Sós on the number of distinct pairs ...
متن کاملRamsey graphs contain many distinct induced subgraphs
It is shown that any graph on n vertices containing no clique and no independent set on t + 1 vertices has at least 2./( 2r2o ~2t)) distinct induced subgraphs.
متن کاملOn Unavoidable Induced Subgraphs in Large Prime Graphs
Chudnovsky, Kim, Oum, and Seymour recently established that any prime graph contains one of a short list of induced prime subgraphs [1]. In the present paper we reprove their theorem using many of the same ideas, but with the key model-theoretic ingredient of first determining the so-called amount of stability of the graph. This approach changes the applicable Ramsey theorem, improves the bound...
متن کاملInduced subgraphs with distinct size or order
We show that for every 0 < < 1/2, there is an n0 = n0( ) such that if n > n0 then every n-vertex graph G of size at least ( n 2 ) and at most (1 − ) ( n 2 ) contains induced k-vertex subgraphs with at least 10−7k different sizes, for every k ≤ n 3 This is best possible, up to a constant factor. This is also a step towards a conjecture by Erdős, Faudree and Sós on the number of distinct pairs (|...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017